Moments of a Markov-modulated, Irreducible Network of Fluid Queues
نویسنده
چکیده
We study a network of fluid queues in which exogenous arrivals are modulated by a continuous-timeMarkov chain. Service rates in each queue are proportional to the queue size, and the network is assumed to be irreducible. Thequeue levels satisfy a linear, vectorvalued differential equation. We obtain joint moments of the queue sizes recursively, and deduce the Laplace transform of the queue sizes in the stationary regime.
منابع مشابه
Longest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملAn approximate compositional approach to the analysis of fluid queue networks
Fluid models have for some time been used to approximate stochastic networks with discrete state. These range from traditional ‘heavy traffic’ approximations to the recent advances in bio-chemical system models. Here we present a simple approximate compositional method for analysing a network of fluid queues with Markovmodulated input processes at equilibrium. The idea is to approximate the on/...
متن کاملMulticlass Markovian fluid queues
This paper considers a multiclass Markovian fluid queue with a buffer of infinite capacity. Input rates of fluid flows in respective classes and the drain rate from the buffer are modulated by a continuous-time Markov chain with finite states. We derive the joint Laplace-Stieltjes transform for the stationary buffer contents in respective classes, assuming the FIFO service discipline. Further w...
متن کاملThe Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کاملDiscrete-time Priority Queues with Two-state Markov Modulated Arrivals
A class of discrete-time priority queueing systems with Markov modulated arrivals is considered. In these systems, N queues are served by a single server according to priorities that are preassigned to the queues. Packet arrivals are modeled as discrete-time batch processes with a distribution that depends on the state of an independent common two-state Markov chain. This allows to cover a wide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006